Heuristic-Search-Based Light Positioning According to Irradiance Intervals
نویسندگان
چکیده
We present a strategy to solve the problem of light positioning in a closed environment. We aim at obtaining, for a global illumination radiosity solution, the position and emission power for a given number of lights that provide a desired illumination at a minimum total emission power. Such a desired illumination is expressed using minimum and/or maximum values of irradiance allowed. A pre-process is needed in which irradiance is computed for a pre-established set of light positions by means of a random walk. The reuse of paths makes this pre-process reasonably cheap. Different heuristic-search strategies are explored and compared in our work, which, combined to linear programming, make it possible to efficiently visit the search space and, in most cases, obtain a good solution at a reasonable cost.
منابع مشابه
Gravitational Search Algorithm to Solve the K-of-N Lifetime Problem in Two-Tiered WSNs
Wireless Sensor Networks (WSNs) are networks of autonomous nodes used for monitoring an environment. In designing WSNs, one of the main issues is limited energy source for each sensor node. Hence, offering ways to optimize energy consumption in WSNs which eventually increases the network lifetime is strongly felt. Gravitational Search Algorithm (GSA) is a novel stochastic population-based meta-...
متن کاملA heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کاملCONFIGURATION OPTIMIZATION OF TRUSSES USING A MULTI HEURISTIC BASED SEARCH METHOD
Different methods are available for simultaneous optimization of cross-section, topology and geometry of truss structures. Since the search space for this problem is very large, the probability of falling in local optimum is considerably high. On the other hand, different types of design variables (continuous and discrete) lead to some difficulties in the process of optimization. In this articl...
متن کاملA Framework for Adapting Population-Based and Heuristic Algorithms for Dynamic Optimization Problems
In this paper, a general framework was presented to boost heuristic optimization algorithms based on swarm intelligence from static to dynamic environments. Regarding the problems of dynamic optimization as opposed to static environments, evaluation function or constraints change in the time and hence place of optimization. The subject matter of the framework is based on the variability of the ...
متن کاملAssessing the Impact of Canopy Structure Simplification in Common Multilayer Models on Irradiance Absorption Estimates of Measured and Virtually Created Fagus sylvatica (L.) Stands
Multilayer canopy representations are the most common structural stand representations due to their simplicity. Implementation of recent advances in technology has allowed scientists to simulate geometrically explicit forest canopies. The effect of simplified representations of tree architecture (i.e., multilayer representations) of four Fagus sylvatica (L.) stands, each with different LAI, on ...
متن کامل